Dividing a polygon into two similar polygons
نویسندگان
چکیده
منابع مشابه
Optimal Nearly-Similar Polygon Stabbers of Convex Polygons
A convex polygon that is nearly-similar to a model polygon P has sides parallel and in the same order to the corresponding sides of P. The lengths of the sides are unrestricted and may be zero. Given a set of target convex polygons in the plane with a total of n vertices, and a xed model convex stabbing polygon P, the minimum-perimeter polygon nearly-similar to P that stabs the targets can be f...
متن کاملDecomposing a simple polygon into pseudo-triangles and convex polygons
In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseudo-triangles and convex polygons. We call the resulting decomposition PTconvex. We are interested in minimum decompositions, i.e., in decomposing the input polygon into the least number of subpolygons. Allowing subpolyg...
متن کاملAn efficient algorithm for decomposing a polygon into star-shaped polygons
In this paper we show how a theorem in plane geometry can be converted into an O(n log n) algorithm for decomposing a polygon into star-shaped subsets. The computational efficiency or this new decomposition contrasts with the heavy computational burden of existing methods. 1.0 Introduction The decomposition of a simple planar polygon into simpler components plays an important role in syntactic ...
متن کاملDividing a supercoiled DNA molecule into two independent topological domains.
Both prokaryotic and eukaryotic chromosomes are organized into many independent topological domains. These topological domains may be formed through constraining each DNA end from rotating by interacting with nuclear proteins; i.e., DNA-binding proteins. However, so far, evidence to support this hypothesis is still elusive. Here we developed two biochemical methods; i.e., DNA-nicking and DNA-gy...
متن کاملStabbing Convex Polygons with a Segment or a Polygon
Let O = {O1, . . . , Om} be a set of m convex polygons in R 2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without reflection), is called free if B does not intersect the interior of any polygon in O at this placement. A placement z of B is called critical if B forms three “distinct” contacts with O at z. Let φ(B,O) be the number of f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2011
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.10.021